# -*- coding: utf-8 -*-
"""
Created on Tue Jul 23 12:09:02 2013

@author: M1010201
"""
from GF2 import one
from itertools import combinations

def summation(L):
    ans = [ L[0][i]*0 for i in range(len(L[0]))]
    for l in L:
        ans = [l[i]+ans[i] for i in range(len(l))]
    return ans
    

 
a = [one,one,0,0,0,0,0]
b = [0,one,one,0,0,0,0]
c = [0,0,one,one,0,0,0]
d = [0,0,0,one,one,0,0]
e = [0,0,0,0,one,one,0]
f = [0,0,0,0,0,one,one]
L = [a,b,c,d,e,f]    

t = [ combinations(L,i) for i in range(2,len(L))]
u1 = [0,0,one,0,0,one,0]
u2 = [0,one,0,0,0,one,0]

p = {t[i][j] for i in range(len(t)) j in range(len(t[i])) if summation(t[i][j]) == u1}